Hexagonal systems with forcing edges
نویسندگان
چکیده
منابع مشابه
Hexagonal systems with forcing edges
An edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect matching of H. Using the concept of Z-transformation of hexagonal system, we give a characterization for the hexagonal systems with forcing edges and determine all forcing edges is such systems. We also give the generating function of all hexagonal systems with forcing edges. A hexaoonal system, also call...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملGrowth mechanism of hexagonal-shape graphene flakes with zigzag edges.
The properties of a graphene nanostructure are strongly influenced by the arrangement of the atoms on its edge. Growing graphene nanostructures with specified edge types in practical, scalable ways has proven challenging, with limited success to date. Here we report a method for producing graphene flakes with hexagonal shape over large areas, by a brief chemical vapor deposition growth at atmos...
متن کاملThe reconstructed edges of the hexagonal BN.
As an important two-dimensional material which shows exceptional mechanical and chemical stability, superior electronic properties, along with broad applications, the hexagonal-BN (h-BN) has drawn great attention recently. Here we report a systematic study on the structural stability, electronic and magnetic properties of various h-BN edges, including both bare and hydrogen-terminated ones. It ...
متن کاملcomplete forcing numbers of polyphenyl systems
the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0184-6